Novel Pseudo-random Number Generation Using Variant Logic Framework

نویسنده

  • Jeffrey Zheng
چکیده

Cyber Security requires cryptology for the basic protection. Among different ECRYPT technologies, stream cipher plays a central role in advanced network security applications; in addition, pseudo-random number generators are placed in the core position of the mechanism. In this paper, a novel method of pseudo-random number generation is proposed to take advantage of the large functional space described using variant logic, a new framework for binary logic. Using permutation and complementary operations on classical truth table to form relevant variant table, numbers can be selected from table entries having pseudo-random properties. A simple generation mechanism is described and shown and pseudo-random sequences are analyzed for their cycle property and complexity. Applying this novel method, it can play a useful role in future applications for higher performance of cyber security environments.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using GLFSRs for Pseudo-Random Memory BIST

In this work, we present the application of Generalized Linear Feedback Shift Registers (GLFSRs) for generation of patterns for pseudo-random memory Built-In SelfTest (BIST). Recently, it was shown that using GLFSRs as pattern generators for pseudo-random logic tests can increase the fault coverage noticeably in comparison to standard pseudo-random test pattern generators. Since memory faults d...

متن کامل

Permutation and Complementary Algorithm to Generate Random Sequences for Binary Logic

Randomness number generation plays a key role in network, information security and IT applications. In this paper, a permutation and complementary algorithm is proposed to use vector complementary and permutation operations to extend n-variable Logic function space from functions to configurations 2 2 n 2 2 2 n n  ! for variant logic framework. Each configuration contains functions can be show...

متن کامل

OPTIMAL DESIGN OF DIAGRID MODULES BY PSEUDO RANDOM DIRECTIONAL SEARCH

The present work reveals a problem formulation to minimize material consumption and improve efficiency of diagrids to resist equivalent wind loading. The integrated formulation includes not only sizing of structural members but also variation in geometry and topology of such a system. Particular encoding technique is offered to handle practical variation of diagrid modules. A variant of Pseudo-...

متن کامل

Parallel Computation of Optimal Parameters for Pseudo Random Number Generation

Two systematic search methods are employed to nd mul-tipliers for linear congruential pseudo-random number generation which are optimal with respect to the discrepancy of pairs of successive pseudo-random numbers. These two methods are compared in terms of their suitability for parallel computation. Experimental results of a MIMD workstationcluster{implementation and an evaluation of the calcul...

متن کامل

Mutadelic: mutation analysis using description logic inferencing capabilities

MOTIVATION As next generation sequencing gains a foothold in clinical genetics, there is a need for annotation tools to characterize increasing amounts of patient variant data for identifying clinically relevant mutations. While existing informatics tools provide efficient bulk variant annotations, they often generate excess information that may limit their scalability. RESULTS We propose an ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011